Towards Precision of Probabilistic Bounds Propagation
نویسندگان
چکیده
The DUCK-calculus presented here is a re cent approach to cope with probabilistic un certainty in a sound and efficient way. Un certain rules with bounds for probabilities and explicit conditional independences can be maintained incrementally. The basic in ference mechanism relies on local bounds propagation, implementable by deductive databases with a bottom-up fixpoint evalu ation. In situations, where no precise bounds are deducible, it can be combined with sim ple operations research techniques on a lo cal scope. In particular, we provide new pre cise analytical bounds for probabilistic entail ment.
منابع مشابه
Anytime Exact Belief Propagation
Statistical Relational Models and, more recently, Probabilistic Programming, have been making strides towards an integration of logic and probabilistic reasoning. A natural expectation for this project is that a probabilistic logic reasoning algorithm reduces to a logic reasoning algorithm when provided a model that only involves 0-1 probabilities, exhibiting all the advantages of logic reasoni...
متن کاملEfficient Tracking of Uncertain Evolving Shapes with Probabilistic Spatio-Temporal Bounds in Sensor Networks Authors
We address the problem of balancing trade-off between the (im)precision of the answer to evolving spatial queries and efficiency of their processing in Wireless Sensor Networks (WSN). Specifically, we focus on scenarios where, in addition to simple measurements one is also interested in the boundaries of a shape in which all the sensors' readings satisfy a certain criteria. Given the evolution ...
متن کاملImproving Bound Propagation
This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the bound propagation scheme by taking advantage of the directionality in Bayesian networks and applying the notion of relevant subnetwork. We also propose an approximation scheme for the linear optimization subproblems. We demonstr...
متن کاملA Generalized Probabilistic Version of Modus Ponens
Modus ponens (from A and “if A then C” infer C; short: MP) is one of the most basic inference rules. The probabilistic MP allows for managing uncertainty by transmitting assigned uncertainties from the premises to the conclusion (i.e., from P (A) and P (C|A) infer P (C)). In this paper, we generalize the probabilistic MP by replacing A by the conditional event A|H . The resulting inference rule...
متن کاملProbabilistic Variational Bounds for Graphical Models
Variational algorithms such as tree-reweighted belief propagation can provide deterministic bounds on the partition function, but are often loose and difficult to use in an “any-time” fashion, expending more computation for tighter bounds. On the other hand, Monte Carlo estimators such as importance sampling have excellent any-time behavior, but depend critically on the proposal distribution. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992